Symbolic Expansion of Transcendental Functions

نویسنده

  • Stefan Weinzierl
چکیده

Higher transcendental function occur frequently in the calculation of Feynman integrals in quantum field theory. Their expansion in a small parameter is a non-trivial task. We report on a computer program which allows the systematic expansion of certain classes of functions. The algorithms are based on the Hopf algebra of nested sums. The program is written in C++ and uses the GiNaC library. PROGRAM SUMMARY Title of program: nestedsums Version: 1.0 Catalogue number: Program obtained from: http://www.fis.unipr.it/ ̃stefanw/nestedsums E-mail: [email protected] License: GNU Public License Computers: all Operating system: all Program language: C++ Memory required to execute: depending on the complexity of the problem, at least 64 MB RAM recommended Other programs called: GiNaC 0.8.3, a library for symbolic calculations in C++, is required. It is available from http://www.ginac.de. Optionally, the program can also be used interactively. In this case the program gTybalt, available from http://www.fis.unipr.it/ ̃stefanw/gtybalt.html is needed. External files needed: none

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

UMMER – Transcendental Functions and Symbolic Summation in F ORM

Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums, where the harmonic sums and their generalizations appear as building blocks, originating for example from the expansion of generalized hypergeometric functions around integer values of the par...

متن کامل

Expansion around half-integer values, binomial sums and inverse binomial sums

I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a symbolic computer algebra system. The method is an extension of the technique of nested sums. The algorithms allow in addition the evaluation of binomial sum...

متن کامل

Model-driven regularization approach to straight line program genetic programming

This paper presents a regularization method for program complexity control of linear genetic programming tuned for transcendental elementary functions. Our goal is to improve the performance of evolutionary methods when solving symbolic regression tasks involving Pfaffian functions such as polynomials, analytic algebraic and transcendental operations like sigmoid, inverse trigonometric and radi...

متن کامل

Translation of Taylor Series into LFT Expansions

In Exact Real Arithmetic, real numbers are represented as potentially infinite streams of information units, called digits. In this paper, we work in the framework of Linear Fractional Transformations (LFT’s, also known as Möbius transformations) that provide an elegant approach to real number arithmetic (Gosper 1972, Vuillemin 1990, Nielsen and Kornerup 1995, Potts and Edalat 1996, Edalat and ...

متن کامل

An Exercise on Real Elementary Functions in the Book “Symbolic Integration I” (second edition)

In this note, we present an answer to Exercise 9.3 in the Book Symbolic Integration I (second edition) by M. Bronstein, under an additional assumption that the real elementary extension in the exercise is purely transcendental. Our answer is based on a rather technical lemma derived from a naive attempt to do the exercise inductively.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره math-ph/0201011  شماره 

صفحات  -

تاریخ انتشار 2002